An equation driven quality classification of (a)symmetric gradient, gradient-block, block-gradient-block and block copolymers

نویسندگان

چکیده

The control of the A/B comonomer distribution over individual chains targeting block and/or gradient monomer distributions is essential to macroscopic properties resulting copolymers. Matrix-based kinetic Monte Carlo simulations allow compare each chain a representative copolymer sample with desired (mathematical) composition, as defined by inclusion probabilities (PA/B) taking B-functionalization degree (B-Func) maximally 50%. A so-called average deviation (SD∗ value) results per chain, close 0 (normalized) structural 〈SD〉 corresponding an almost perfect structure and 1 representing worst case scenario B-homopolymer. previously assigned transitions from excellent good poor are, however, somewhat arbitrary, e.g. for both symmetric copolymers threshold 〈SDGood/Poor〉 0.3 currently utilized only specific asymmetric cases (30% B-Func block, block-gradient, gradient) 〈SDExc/Good〉 values have been reported. present work puts forward equation driven method obtain values, minimizing arbitrary nature quality classification given type more importantly aligning assessment any containing elements. Emphasis on complete SD (instead its average) (a)symmetric AB gradient, A-gradient AB, AB-block B, introducing overall fractions (fGr/Bl) novel parameter alongside targeted polymerization (target DP) B-Func. Ideal theoretical structures equal length implementation PA/B profiles are dealt with, they represent best actual synthesis recipe could deliver in limit. It shown that log-normal can be reliably used approximate distribution, coefficients determination (R2) very one follow . further showcased dominant must higher than those block-like well-defined difficult achieve ones. also recommended report together standard σSD.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Transform Adaptation by Stochastic Gradient Descent

The problem of computing the eigendecomposition of an N N symmetric matrix is cast as an unconstrained minimization of either of two performance measures. The K = N(N 1)=2 independent parameters represent angles of distinct Givens rotations. Gradient descent is applied to the minimization problem, step size bounds for local convergence are given, and similarities to LMS adaptive filtering are n...

متن کامل

Self-organization of Gradient and Block Copolymers with Complexing Properties in Supercritical Co2

We report the synthesis of new gradient and block fluorinated copolymers, which have complexing properties and are soluble in supercritical carbon dioxide. Poly(1,1,2,2-tetrahydroperfluorodecyl acrylate-co-acetoacetoxyethyl methacrylate) (poly(FDA-co-AAEM)) and poly(1,1,2,2tetrahydroperfluorodecyl acrylate-co-vinylbenzylphosphonic acid diethylester) (poly(FDA-coVBPDE) were synthesized by revers...

متن کامل

Block stochastic gradient iteration for convex and nonconvex optimization

The stochastic gradient (SG) method can minimize an objective function composed of a large number of differentiable functions or solve a stochastic optimization problem, very quickly to a moderate accuracy. The block coordinate descent/update (BCD) method, on the other hand, handles problems with multiple blocks of variables by updating them one at a time; when the blocks of variables are (much...

متن کامل

Vectorization of some block preconditioned conjugate gradient methods

The block preconditioned conjugate gradient methods are very effective to solve the linear systems arising from the discretization of elliptic PDE. Nevertheless, the solution of the linear system Ms = r, to get the preconditioned residual, is a 'bottleneck', on vector processors. In this paper, we show how to modify the algorithm, in order to get better performances, on such computers. Numerica...

متن کامل

A Block Matching Technique Using Unit Gradient Vectors

Irregular lighting causes temporal variations of image intensities, which makes most existing block matching techniques ineffective. For this, we propose a novel matching technique based on gradient orientation that is known to be insensitive to variations of intensities. We show that gradient orientation information can be effectively utilized by means of two intensity patterns that are obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Polymer Journal

سال: 2023

ISSN: ['0014-3057', '1873-1945']

DOI: https://doi.org/10.1016/j.eurpolymj.2022.111769